DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
نویسندگان
چکیده
منابع مشابه
Decontaminating Chordal Rings and Tori Using Mobile Agents
In this paper we consider a network where an intruder is moving “contaminating” the nodes it passes by, and we focus on the problem of decontaminating such a network by a team of mobile agents. The contamination/decontamination process has the following asynchronous dynamics: when the team is deployed all nodes are assumed to be contaminated, when an agent transits on a node, it will clean the ...
متن کاملOptimal Distributed Algorithms in Unlabelled Tori and Chordal Rings
We study the message complexity of distributed algorithms in Tori and Chordal Rings when the communication links are unlabelled, which implies that the processors do not have a globally consistent labelling of the communication links. They have no \Sense of Direction" but have only a topological awareness. We use a preprocessing algorithm to introduce the notion of handrail, a partial structura...
متن کاملPeriodically Regular Chordal Rings
ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...
متن کاملBoolean Routing on Chordal Rings
In this paper we consider the problem of routing messages in a network of processors conngured as a chordal ring. In particular we refer to the Boolean Routing model, and we introduce a new routing function for unidirectional and bidirectional chordal rings with degree four. This function requires O(n log n) bits of storage and O(n) time to compute, in the worst case. We also study some relatio...
متن کاملBroadcasting in generalized chordal rings
Broadcasting is an information dissemination process in which a message originating at one node of a communication network (modeled as an undirected graph) is sent to all other nodes by means of calls involving two nodes at a time, with each node participating in at most one call at any time. We are interested in efficient broadcasting in a class of cubic graphs known as generalized chordal rin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2007
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054107004838